de_util ~master (2021-10-26T20:15:40.7960244)

dijkstra_search

devisualization util algorithms pathfinding dijkstra

Locates the next node in graph to get to a position Uses Dijkstra search algorithm

deprecated
void
dijkstra_search
(
T
U
)
(
GridWithWeights graph
,
T start
,
T goal
,
out T[T] came_from
,
out U[T] cost_so_far
)

Parameters

graph GridWithWeights

The graph of nodes

start T

Starting position to go to

goal T

The end position

came_from T[T]

The positions between start and end

cost_so_far U[T]

Sum of weights (cost) to get to goal from start

Meta

Source

See Implementation

devisualization util algorithms pathfinding dijkstra functions

Page generated by adrdox